Discrete rigid registration: A local graph-search approach
نویسندگان
چکیده
منابع مشابه
Discrete rigid registration: A local graph-search approach
Image registrationhas becomea crucial step in awide range of imaging domains, fromcomputer vision to computer graphics. The core of image registration consists of determining the transformation that induces the best mapping between two images. This problem is ill-posed; it is also difficult to handle, due to the high size of the images and the high dimension of the transformation parameter spac...
متن کاملDiscrete Rigid Transformation Graph Search for 2D Image Registration
Rigid image registration is an essential image processing task, with a large body of applications. This problem is usually formulated in the continuous domain, often in the context of an optimization framework. This approach leads to sometimes unwanted artifacts, e.g. due to interpolation. In the case of purely discrete applications, e.g., for template-based segmentation or classification, it i...
متن کاملEfficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search
Rigid transformations are involved in a wide variety of image processing applications, including image registration. In this context, we recently proposed to deal with the associated optimization problem from a purely discrete point of view, using the notion of discrete rigid transformation (DRT) graph. In particular, a local search scheme within the DRT graph to compute a locally optimal solut...
متن کاملLocal Rigid Registration: A tumour localization application
We present a fast, interactive local rigid registration application to localize tumour’s position for radiotherapy. The aim of the application is to automatically localize in a therapy CT dataset the target volume marked in a plan CT before applying a therapy. The algorithm is fast because it restricts the registration to a small area of the whole dataset. Once the target is found, the applicat...
متن کاملNon-rigid Image Registration Using Graph-cuts
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a powerful combinatorial optimization tool which has been successfully applied into image segmentation and stereo matching. Under some specific constraints, graph-cuts method yields either a global minimum or a local min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.05.005